Key Management Building Blocks for Wireless Sensor Networks

Cryptography is the means to ensure data confidentiality, integrity and authentication in wireless sensor networks (WSNs). To use cryptography effectively however, the cryptographic keys need to be managed properly. First of all, the necessary keys need to be distributed to the nodes before the nodes are deployed in the field, in such a way that any two or more nodes that need to communicate securely can establish a session key. Then, the session keys need to be refreshed from time to time to prevent birthday attacks. Finally, in case any of the nodes is found to be compromised, the key ring of the compromised node needs to be revoked and some or all of the compromised keys might need to be replaced. These processes, together with the policies and techniques needed to support them, are called key management. The facts that WSNs (1) are generally not tamper-resistant; (2) operate unattended; (3) communicate in an open medium; (4) have no fixed infrastructure and pre-configured topology; (5) have severe hardware and resource constraints, present unique challenges to key management. In this article, we explore techniques for meeting these challenges. What distinguishes our approach from a routine literature survey is that, instead of comparing various known schemes, we set out to identify the basic cryptographic principles, or building blocks that will allow practitioners to set up their own key management framework using these building blocks

Survey and Benchmark of Block Ciphers for Wireless Sensor Networks

Cryptographic algorithms play an important role in the security architecture of wireless sensor networks (WSNs). Choosing the most storage- and energy-efficient block cipher is essential, due to the facts that these networks are meant to operate without human intervention for a long period of time with little energy supply, and that available storage is scarce on these sensor nodes. However, to our knowledge, no systematic work has been done in this area so far.We construct an evaluation framework in which we first identify the candidates of block ciphers suitable for WSNs, based on existing literature and authoritative recommendations. For evaluating and assessing these candidates, we not only consider the security properties but also the storage- and energy-efficiency of the candidates. Finally, based on the evaluation results, we select the most suitable ciphers for WSNs, namely Skipjack, MISTY1, and Rijndael, depending on the combination of available memory and required security (energy efficiency being implicit). In terms of operation mode, we recommend Output Feedback Mode for pairwise links but Cipher Block Chaining for group communications

Benchmarking Block Ciphers for Wireless Sensor Networks

Choosing the most storage- and energy-efficient block cipher specifically for wireless sensor networks (WSNs) is not as straightforward as it seems. To our knowledge so far, there is no systematic evaluation framework for the purpose. We have identified the candidates of block ciphers suitable for WSNs based on existing literature. For evaluating and assessing these candidates, we have devised a systematic framework that not only considers the security properties but also the storage- and energy-efficency of the candidates. Finally, based on the evaluation results, we have selected the suitable ciphers for WSNs, namely Rijndael for high security and energy efficiency requirements; and MISTY1 for good storage and energy efficiency

KALwEN: A New Practical and Interoperable Key Management Scheme for Body Sensor Networks

Key management is the pillar of a security architecture. Body sensor networks(BSNs) pose several challenges -- some inherited from wireless sensor networks(WSNs), some unique to themselves -- that require a new key management scheme to be tailor-made. The challenge is taken on, and the result is KALwEN, a new lightweight scheme that combines the best-suited cryptographic techniques in a seamless framework. KALwEN is user-friendly in the sense that it requires no expert knowledge of a user, and instead only requires a user to follow a simple set of instructions when bootstrapping or extending a network. One of KALwEN's key features is that it allows sensor devices from different manufacturers, which expectedly do not have any pre-shared secret, to establish secure communications with each other. KALwEN is decentralized, such that it does not rely on the availability of a local processing unit (LPU). KALwEN supports global broadcast, local broadcast and neighbor-to-neighbor unicast, while preserving past key secrecry and future key secrecy. The fact that the cryptographic protocols of KALwEN have been formally verified also makes a convincing case

Security and dependability for Ambient Intelligence: Informative but busy

The edited volume “Security and Dependability for Ambient Intelligence‿ is a comprehensive compilation of the research outcomes of the 3 year-long 7.8 million Euro European Framework Programme 6 project SERENITY (FP6-IST-2006-27587). At a time when Stuxnet and large scale data breaches at PlayStation Network and RSA have taken over global news headlines, the need for a systematic approach to developing, deploying and dynamically configuring security solutions marks the timely arrival of this highly useful volume

Dynamic tunnel routing for reliable and resilient data forwarding in wireless sensor networks

n/

KLEIN: A New Family of Lightweight Block Ciphers

Resource-efficient cryptographic primitives become fundamental for realizing both security and efficiency in embedded systems like RFID tags and sensor nodes. Among those primitives, lightweight block cipher plays a major role as a building block for security protocols. In this paper, we describe a new family of lightweight block ciphers named KLEIN, which is designed for resource-constrained devices such as wireless sensors and RFID tags. Compared to the related proposals, KLEIN has advantage in the software performance on legacy sensor platforms, while in the same time its hardware implementation can also be compact

Comparison between simulated and observed LHC beam backgrounds in the ATLAS experiment at Ebeam =4 TeV

Results of dedicated Monte Carlo simulations of beam-induced background (BIB) in the ATLAS experiment at the Large Hadron Collider (LHC) are presented and compared with data recorded in 2012. During normal physics operation this background arises mainly from scattering of the 4 TeV protons on residual gas in the beam pipe. Methods of reconstructing the BIB signals in the ATLAS detector, developed and implemented in the simulation chain based on the \textscFluka Monte Carlo simulation package, are described. The interaction rates are determined from the residual gas pressure distribution in the LHC ring in order to set an absolute scale on the predicted rates of BIB so that they can be compared quantitatively with data. Through these comparisons the origins of the BIB leading to different observables in the ATLAS detectors are analysed. The level of agreement between simulation results and BIB measurements by ATLAS in 2012 demonstrates that a good understanding of the origin of BIB has been reached

Prompt and non-prompt J/psi elliptic flow in Pb plus Pb collisions at root S-NN=5.02 TeV with the ATLAS detector

The elliptic flow of prompt and non-prompt J/ \u3c8 was measured in the dimuon decay channel in Pb+Pb collisions at sNN=5.02 TeV with an integrated luminosity of 0.42nb-1 with the ATLAS detector at the LHC. The prompt and non-prompt signals are separated using a two-dimensional simultaneous fit of the invariant mass and pseudo-proper decay time of the dimuon system from the J/ \u3c8 decay. The measurement is performed in the kinematic range of dimuon transverse momentum and rapidity 9 < pT< 30 GeV , | y| < 2 , and 0\u201360% collision centrality. The elliptic flow coefficient, v2, is evaluated relative to the event plane and the results are presented as a function of transverse momentum, rapidity and centrality. It is found that prompt and non-prompt J/ \u3c8 mesons have non-zero elliptic flow. Prompt J/ \u3c8v2 decreases as a function of pT, while for non-prompt J/ \u3c8 it is, with limited statistical significance, consistent with a flat behaviour over the studied kinematic region. There is no observed dependence on rapidity or centrality

Search for squarks and gluinos in final states with hadronically decaying tau-leptons, jets, and missing transverse momentum using pp collisions at root s = 13 TeV with the ATLAS detector

A search for supersymmetry in events with large missing transverse momentum, jets, and at least one hadronically decaying τ-lepton is presented. Two exclusive final states with either exactly one or at least two τ-leptons are considered. The analysis is based on proton-proton collisions at √s=13  TeV corresponding to an integrated luminosity of 36.1  fb⁻¹ delivered by the Large Hadron Collider and recorded by the ATLAS detector in 2015 and 2016. No significant excess is observed over the Standard Model expectation. At 95% confidence level, model-independent upper limits on the cross section are set and exclusion limits are provided for two signal scenarios: a simplified model of gluino pair production with τ-rich cascade decays, and a model with gauge-mediated supersymmetry breaking (GMSB). In the simplified model, gluino masses up to 2000 GeV are excluded for low values of the mass of the lightest supersymmetric particle (LSP), while LSP masses up to 1000 GeV are excluded for gluino masses around 1400 GeV. In the GMSB model, values of the supersymmetry-breaking scale are excluded below 110 TeV for all values of tanβ in the range 2 ≤ tanβ ≤ 60, and below 120 TeV for tanβ > 30.M. Aaboud … D. Duvnjak … P. Jackson … J.L. Oliver … A. Petridis … A. Qureshi … A.S. Sharma … M.J. White … et al. [The ATLAS Collaboration